Linear bounded automaton
NONDETERMINISTIC TURING MACHINE WITH A POTENTIALLY INFINITE TAPE ON WHICH TO COMPUTE, IN WHICH COMPUTATION IS RESTRICTED TO THE PORTION OF THE TAPE CONTAINING THE INPUT PLUS THE TWO TAPE SQUARES HOLDING THE ENDMARKERS
Linear bounded automata; LBA-compete; LBA compete
In computer science, a linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of Turing machine.